On the Quadratic Transportation Problem
نویسندگان
چکیده
We present a direct analytical algorithm for solving transportation problems with quadratic function cost coefficients. The algorithm uses the concept of absolute points developed by the authors in earlier works. The versatility of the proposed algorithm is evidenced by the fact that quadratic functions are often used as approximations for other functions, as in, for example, regression analysis. As compared with the earlier international methods for quadratic transportation problem (QTP) which are based on the Lagrangian relaxation approach, the proposed algorithm helps to understand the structure of the QTP better and can guide in managerial decisions. We present a numerical example to illustrate the application of the proposed method.
منابع مشابه
A Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA green transportation location-inventory-routing problem by dynamic regional pricing
Non-uniform distribution of customers in a region and variation of their maximum willingness to pay at distinct areas make regional pricing a practical method to maximize the profit of the distribution system. By subtracting the classic objective function, which minimizes operational costs from revenue function, profit maximization is aimed. A distribution network is designed by determining the...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملHalf-quadratic transportation problems
We present a primal–dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of weighted quadratic transportation problems. The new formulation allows us to solve differentiable, non– convex transportation problems.
متن کاملAn Algorithm for Solving an Indefinite Quadratic Transportation Problem with Specified Flow
In the present paper, an indefinite quadratic transportation problem with specified flow is studied. If in addition to the flow constraint, the minimum requirement of each destination is also specified then the situation arises of distributing at minimum cost a certain commodity produced in a country, after keeping reserve stocks, to various states with minimum requirement of each state specifi...
متن کامل